Minimal obstructions for a matrix partition problem in chordal graphs

نویسندگان

چکیده

In this article we consider graph partitions with prescribed patterns. Specifically a 2-colouring of the vertex set such that one colour induces an independent and other complete bipartite graph. We determine list obstructions (minimal forbidden induced subgraphs) for chordal graphs. This result completes knowledge on minimal 3 × matrix partition problems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Obstructions to partitions of chordal graphs

Matrix partition problems generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M , whether the M partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M -partitionable graphs can be characterized by a finite set of forbidden induced subgraphs (or per...

متن کامل

When are chordal graphs also partition graphs?

A general partition graph (gpg) is an intersection graph G on a set S so that for every maximal independent set M of vertices in G, the subsets assigned to the vertices in M partition S. These graphs have been characterized by the presence of special clique covers. The Triangle Condition T for a graph G is that for any maximal independent set M and any edge uv in G M, there is a vcrtex W E M so...

متن کامل

Matrix Partitions of Split Graphs

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split graphs. Previously such a result was only known for the class of cographs. (In particular, there are matrix partition problems which have infinitely many mini...

متن کامل

Obstructions to chordal circular-arc graphs of small independence number

A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path missed by the remaining two vertices. This is akin to the notion of asteroidal triple used in the classical characterization of interval graphs by Lekkerkerk...

متن کامل

The 2-Center Problem in Chordal Graphs

In a graph G, the p-center problem is to identify p vertices of G for locating some kind of facilities such that the maximum among the distances from all vertices to their nearest facility is minimized. In this paper, we propose an O(n)-time algorithm for computing a 2-center in a chordal graph with maximum degree at most three, where a graph is chordal if every induced cycle of length at least...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2023

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2022.09.012